1350B - Orac and Models - CodeForces Solution

//#include "debuge.cpp"
#include <bits/stdc++.h>

using namespace std;

typedef long long i64;

void solve() {
	int n;
	cin >> n;
	vector<i64> a(n + 1);
	for(int i = 1; i <= n; i++) cin >> a[i];
	vector<i64> dp(n + 1, 1);
	for(int i = 2; i <= n; i++) {
		i64 mx = 1;
		for(int j = 1; j * j <= n; j++) {
			if(i % j ==0) {
				if(a[i] > a[j]) mx = max(mx, dp[j] + 1);
				if(a[i] > a[i / j]) mx = max(mx, dp[i / j] + 1);
			}
		}
		dp[i] = mx;
	}
	cout << *max_element(dp.begin(), dp.end()) << '\n';
}
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
    if(fopen("in", "r")) {
        freopen("in", "r", stdin);
        freopen("out", "w", stdout);
    }
	int tc;
	cin >> tc;
	while(tc--) solve();
}